#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<string.h>
char a[1006][1006];
int n, m;
void DFS(int i, int j)
{
    if (i >= 0 && i < n && j >= 0 && j < m && a[i][j] == 'W') {
        a[i][j] = '.';
        DFS(i - 1, j - 1);
        DFS(i - 1, j);
        DFS(i - 1, j + 1);
        DFS(i, j - 1);
        DFS(i, j + 1);
        DFS(i + 1, j - 1);
        DFS(i + 1, j);
        DFS(i + 1, j + 1);
    }
}
int main()
{
    int i, j, flag = 0;
    while (scanf("%d %d", &n, &m) != EOF)
    {
        memset(a, '0', sizeof(a));
        flag = 0;
        for (i = 0; i <= n - 1; i++)
            scanf("%s", a[i]);
        for (i = 0; i <= n - 1; i++)
        {
            for (j = 0; j <= m - 1; j++)
            {
                if (a[i][j] == 'W')
                {
                    flag++;
                    DFS(i, j);
                }
            }
        }
        printf("%d\n", flag);
    }
}
/*
Description

Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.

Given a diagram of Farmer John's field, determine how many ponds he has.
Input

* Line 1: Two space-separated integers: N and M

* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.
Output

* Line 1: The number of ponds in Farmer John's field.
Sample Input

10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.
Sample Output

3
*/